Minimizing the Total Completion Time and Maximum Tardiness on a Scheduling with a Learning Effect

A Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect

In this paper a single machine scheduling problem to minimize tardy jobs is considered. To increase the reality of the problem, deterioration and learning effect is added to. Beside, according to Inherent uncertainty in processing times, they are considered to be normally distributed. To find an appropriate solution, four existing models are extended and the results are compared to validate them.

A Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times

The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...

Company ON MINIMIZING TOTAL COMPLETION TIME IN BATCHMACHINE SCHEDULING